Speed analyse of two step algorithms of trigonometric transformations on multi-core processors
نویسنده
چکیده
The two-stage trigonometric transformations algorithms have full symmetry calculations for each stage of the algorithm. Such algorithm may be subjected to any decomposition allowing to split the process of the calculations into any number of processes, which can be implemented independently within one step of the algorithm. Additionally, a single step of algorithm may depend on the size of the data and the associated number of arithmetic operations, which implementation may depend on available hardware resources. In the article the results of the computations experiments for multi-core processors are presented and compared. Streszczenie. Dwuetapowe algorytmy przekształceń trygonometrycznych posiadają pełną symetrię obliczeń dla poszczególnych bloków algorytmu. Algorytm taki może być poddany dowolnej dekompozycji pozwalając na rozdzielenie procesu obliczeń na dowolną liczbę procesów, które mogą być realizowane niezależnie w obrębie jednego kroku algorytmu. Dodatkowo pojedynczy krok algorytmu może być uzależniony od wielkości danych i związanych z nim liczby operacji arytmetycznych, których realizacja może być uzależniona od dostępnych zasobów sprzętowych. W artykule zaprezentowano i porównano wyniki szybkości algorytmu otrzymane dla procesorów wielordzeniowych. (Analiza szybkości dwuetapowych algorytmów przekształceń trygonometrycznych dla procesorów wielordzeniowych)
منابع مشابه
Hand Gestures Classification with Multi-Core DTW
Classifications of several gesture types are very helpful in several applications. This paper tries to address fast classifications of hand gestures using DTW over multi-core simple processors. We presented a methodology to distribute templates over multi-cores and then allow parallel execution of the classification. The results were presented to voting algorithm in which the majority vote was ...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملHyperspectral Image Classification Based on the Fusion of the Features Generated by Sparse Representation Methods, Linear and Non-linear Transformations
The ability of recording the high resolution spectral signature of earth surface would be the most important feature of hyperspectral sensors. On the other hand, classification of hyperspectral imagery is known as one of the methods to extracting information from these remote sensing data sources. Despite the high potential of hyperspectral images in the information content point of view, there...
متن کاملUltra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کامل